Majority vote following a debate
نویسندگان
چکیده
Voters determine their preferences over alternatives based on cases (or arguments) that are raised in the public debate. Each voter is characterized by a matrix, measuring how much support each case lends to each alternative, and her ranking is additive in cases. We show that the majority vote in such a society can be any function from sets of cases to binary relations over alternatives. A similar result holds for voting with quota in the case of two alternatives.
منابع مشابه
Evolving Argument Strategies in the Debate over Same-sex Marriage in the U.s
The debate over same-sex marriage in the U.S. is taking place in the legal sphere in the court system as well as in the public sphere leading up to various state ballot initiatives. In an earlier project, I analyzed the differences in argumentation in the technical and public spheres in 2008 concerning Proposition 8 in California (Schiappa 2012). My colleagues and I found that the norms and pra...
متن کاملOn Voting Ensembles of Classiiers (extended Abstract)
We study the classiication ability of majority-vote ensembles of classiiers. A majority ensemble classiies a pattern by letting each member of the ensemble cast a single vote for the correct class and decides according to a simple majority or a special majority vote. We give upper and lower bounds on the classiication performance of a majority ensemble as a function of the classiication perform...
متن کاملLearning with Randomized Majority Votes
We propose algorithms for producing weighted majority votes that learn by probing the empirical risk of a randomized (uniformly weighted) majority vote—instead of probing the zero-one loss, at some margin level, of the deterministic weighted majority vote as it is often proposed. The learning algorithms minimize a risk bound which is convex in the weights. Our numerical results indicate that le...
متن کاملCombining Fuzzy partitions Using Fuzzy Majority Vote and KNN
this paper firstly generalizes majority vote to fuzzy majority vote, then proposes a cluster matching algorithm that is able to establish correspondence among fuzzy clusters from different fuzzy partitions over a common data set. Finally a new combination model of fuzzy partitions is build on the basis of the proposed cluster matching algorithm and fuzzy majority vote. Comparative results show ...
متن کامل"Good" and "Bad" Diversity in Majority Vote Ensembles
Although diversity in classifier ensembles is desirable, its relationship with the ensemble accuracy is not straightforward. Here we derive a decomposition of the majority vote error into three terms: average individual accuracy, “good” diversity and “bad diversity”. The good diversity term is taken out of the individual error whereas the bad diversity term is added to it. We relate the two div...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Choice and Welfare
دوره 23 شماره
صفحات -
تاریخ انتشار 2004